bch codes造句

• Realization of decoding binary bch codes based on peterson algorithm
  码软件解码的实现
• The presented method is shown to be right through computer simulation for the ( 23.12 ) golay code and the ( 15, 7 ) bch code
  对golay码和bch码的计算机仿真表明，本文提出的方法是正确的。
• These sub-codes can be the same or not, bch code, single parity check code, extended hamming code, and so on
  这些子码可以相同也可以不同,可以是bch码、单奇偶校验码、扩展hamming码等。
• The features of the proposed algorithm include that : ( l ) the algorithm reduces error probabilities of detection by use of bch code
  该算法具有如下特点：(1)应用bch编码来降低隐藏信息的检测错误概率。
• From these conclusions some results are obtained on absolute minimal trellis complexities of extended primitive bch codes and their dual codes of primitive bch codes
  由此得出有关本原bch码的扩展bch码及其对偶码绝对最小网格图复杂度的若干结论。
• From these conclusions some results are obtained on absolute minimal trellis complexities of extended primitive bch codes and their dual codes of primitive bch codes
  由此得出有关本原bch码的扩展bch码及其对偶码绝对最小网格图复杂度的若干结论。
• Official languages authentic chinese text merchant shipping prevention of oil pollution regulation, merchant shipping control of pollution by noxious liquid substances in bulk regulations, merchant shipping reporting of pollution incidents regulations, merchant shipping bch code regulations, merchant shipping ibc code regulations and merchant shipping prevention of oil pollution regulations exemption notice order
  21.法定语文中文真确本商船防止油类污染规例商船控制散装有毒液体物质污染规例商船报告污染事故规例商船散化
• Is the eth residue of p . since the number of quadratic residue mod p is, we can guess the number of eth residue mod p is 2 ^, and then prove this property . on the basis of eth residue, we construct a type of eth residue code of length p which is an odd prime, and extend some properties of quadratic residue codes . alsi ) we construct a cubic residue code over f % of length 31 and a 4th residue code over fs of length 13 . according to the properties of the bounds of bch codes, we determine the minimal distance of [ 31, 21 ] code is 5, which means this code; can correct two errors
  由模p的二次剩余个数为个，可猜测模p的e次剩余的个数为个，本文给出了该性质的证明。在e次剩余的基础上，本文构造了一类字长p为奇素数的e次剩余码，讨论了它的性质，从而推广了二次剩余码的一些结果。利用所导出的理论结果，我们构造了长为31的二元三次剩余码和长为13的三元四次剩余码，利用bch码上下界的性质，进一步确定了31，21码的极小距离为5，它可以纠正两个错误。
• At last, by using the factorization properties of cyclotomic polynmials on finite fields and the construction characteristic of cyclic codes, we present the relation of the period distribution of cyclic codes and the period distribution of their dual codes, establish the explicit formula for the number of the codewords without inner-period of the cyclic codes and their dual codes, find the method for computing the dimension and the period distribution of narrow-sense primitive bch codes, and study the inverse question of period distribution of cyclic codes
  最后，利用有限域上分圆多项式的分解特性和循环码的构造特点，揭示了循环码的周期分布与其对偶码周期分布之间的内在联系，确定了一般循环码及其对偶码内无内周期码字的精确计数公式，决定了狭义本原bch码的维数与周期分布，讨论了循环码周期分布的反问题。
• The concept of good codes and proper codes for both error detection and correction is presented . it is shown that the binary perfect codes and the primitive double-error-correcting bch codes and their extended codes are proper for both error detection and correction . the primitive triple-error-correcting bch codes with length 2 " "-1 and their extended codes are proper for odd m > 5, not for even m > 6
  本文的主要工作是把目前关于只检错时线性码不可检错误概率的研究推广到同时纠错和检错的情况，获得了同时纠检错时线性码不可检错误概率的解析表达式，提出了纠检错好码和最佳纠检错码的概念，并证明了二进制完备码及其扩展码是最佳纠检错码；纠正两个错误二进制本原bch码及其扩展码是最佳纠检错码；码长n=2~m-1、纠正三个错误本原bch码，当m为大于等于5的奇数时是最佳纠检错码；当m为大于等于6的偶数时，不是最佳码。
• The concept of good codes and proper codes for both error detection and correction is presented . it is shown that the binary perfect codes and the primitive double-error-correcting bch codes and their extended codes are proper for both error detection and correction . the primitive triple-error-correcting bch codes with length 2 " "-1 and their extended codes are proper for odd m > 5, not for even m > 6
  本文的主要工作是把目前关于只检错时线性码不可检错误概率的研究推广到同时纠错和检错的情况，获得了同时纠检错时线性码不可检错误概率的解析表达式，提出了纠检错好码和最佳纠检错码的概念，并证明了二进制完备码及其扩展码是最佳纠检错码；纠正两个错误二进制本原bch码及其扩展码是最佳纠检错码；码长n=2~m-1、纠正三个错误本原bch码，当m为大于等于5的奇数时是最佳纠检错码；当m为大于等于6的偶数时，不是最佳码。